package 百度;

public class _204_计数质数 {
    public int countPrimes(int n) {
        int[] dp = new int[n + 1];

        if (n < 2) return 0;
        dp[2] = 1;

        for (int i = 3; i < dp.length; i++) {
            
        }

        return dp[n];
    }
}
